Combining Fixed-Point Definitions and Game Semantics in Logic Programming
نویسنده
چکیده
Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically based on intuitionistic provability. We extend the operational semantics of these languages with game semantics. This extended semantics has several interesting aspects: in particular, it gives a logical status to the read predicate. keywords: interaction, game semantics, read, computability logic.
منابع مشابه
Fixed-point semantics and the representation of algorithms on large data
In the first part of this paper, we differentiate between two fixed-point semantics that can be used to interpret logic-programs using relations together with functions: on the one hand the fixed-point semantic used in logic-programming [ 121, where no difference is made between data and logical definitions, and on the other hand the fixed-point semantic used in the theory of inductive definiti...
متن کاملAn infinite-game semantics for well-founded negation in logic programming
We present an infinite-game characterization of the well-founded semantics for functionfree logic programs with negation. Our game is a simple generalization of the standard game for negationless logic programs introduced by van Emden [M.H. van Emden, Quantitative deduction and its fixpoint theory, Journal of Logic Programming 3(1):37–53, 1986] in which two players, the Believer and the Doubter...
متن کاملID-logic and the Ramification Problem for the Situation Calculus
The goal of this paper is to extend the general solution to the ramification problem for the situation calculus to the case where causal rules specifying indirect effects of actions may form cycles or cycles through negation. We formulate causal dependencies as rules of inductive definitions. Then we give a semantics to a logic for representing inductive definitions (ID-logic) by translating de...
متن کاملWell-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators which generalizes all main semantics of logic programming, default logic and autoepistemic logic. In this paper, we study inductive constructions using operators and show their confluence to the well-founded fixpoint of the operator. This result is one argument for the thesis that Approximation theory is ...
متن کاملThe Fuzzy Description Logic G-FL0 with Greatest Fixed-Point Semantics
We study the fuzzy extension of the Description Logic FL0 with semantics based on the Gödel t-norm. We show that subsumption w.r.t. a finite set of primitive definitions, using greatest fixed-point semantics, can be characterized by a relation on weighted automata. We use this result to provide tight complexity bounds for reasoning in this logic, showing that it is PSpace-complete. If the defin...
متن کامل